Computational Aspects of Optional Pólya Tree

Optional Polya Tree and Bayesian Inference

We introduce an extension of the Pólya tree approach for constructing distributions on the space of probability measures. By using optional stopping and optional choice of splitting variables, the construction gives rise to random measures that are absolutely continuous with piecewise smooth densities on partitions that can adapt to fit the data. The resulting “optional Pólya tree” distribution...

Computational aspects of hydroformylation

The influence of transition metal complexes as catalysts upon the activity and selectivity of hydroformylation reactions has been extensively investigated during the last decades. Nowadays computational chemistry is an indispensable tool for elucidation of reaction mechanisms and for understanding the various aspects which govern the outcome of catalytic reactions. This review attempts to surve...

Computational Aspects of Treewidth

Computational Aspects of NUCOMP

In 1989, Shanks introduced the NUCOMP algorithm [10] for computing the reduced composite of two positive definite binary quadratic forms of discriminant ∆. Essentially by applying reduction before composing the two forms, the intermediate operands are reduced from size O(∆) to O(∆) in most cases and at worst to O(∆). Shanks made use of this to extend the capabilities of his hand-held calculator...

On Generalized Pólya Urn Models

We study an urn model introduced in the paper of Chen and Wei [2], where at each discrete time step m balls are drawn at random from the urn containing colors white and black. Balls are added to the urn according to the inspected colors, generalizing the well known Pólya-Eggenberger urn model, case m = 1. We provide exact expressions for the expectation and the variance of the number of white b...